Conductance and Rapidly Mixing Markov Chains
نویسنده
چکیده
Conductance is a measure of a Markov chain that quantifies its tendency to circulate around its states. A Markov chain with low conductance will tend to get ‘stuck’ in a subset of its states whereas one with high conductance will jump around its state space more freely. The mixing time of a Markov chain is the number of steps required for the chain to approach its stationary distribution. There is an inverse correlation between conductance and mixing time. Rapidly mixing Markov chains have very powerful applications, most notably in approximation schemes. It is therefore desirable to prove certain Markov chains to be rapidly mixing, and bounds involving conductance can help us do that. This survey covers many useful bounds involving conductance and gives several specific examples of applications of rapidly mixing Markov chains.
منابع مشابه
Rapidly Mixing Markov Chains: A Comparison of Techniques
For many fundamental sampling problems, the best, and often the only known, approach to solving them is to take a long enough random walk on a certain Markov chain and then return the current state of the chain. Techniques to prove how long “long enough” is, i.e., the number of steps in the chain one needs to take in order to be sufficiently close to the stationary distribution of the chain, ar...
متن کاملRapidly Mixing Markov Chains: A Comparison of Techniques (A Survey)
For many fundamental sampling problems, the best, and often the only known, approach to solving them is to take a long enough random walk on a certain Markov chain and then return the current state of the chain. Techniques to prove how long “long enough” is, i.e., the number of steps in the chain one needs to take in order to be sufficiently close to the stationary distribution of the chain, ar...
متن کاملFaster Mixing for all Conductance Methods
We consider isoperimetric (geometric) methods for showing rapid convergence of Markov chains. Previous isoperimetric proofs involved the conductance Φ, which was bounded through geometric, inductive or canonical path methods. We extend these three methods and obtain bounds on a new isoperimetric quantity known as the blocking conductance φ(x). This leads to mixing time bounds typically within a...
متن کاملTwo conductance theorems, two canonical path theorems, and two walks on directed Cayley graphs
We show two Conductance-like theorems for mixing time of non-reversible non-lazy walks. These bounds involve a measure of expansion which expresses how well ergodic flow is distributed among vertices, which while conceptually similar to Blocking Conductance apply to non-lazy non-reversible Markov chains as well. As an application we derive two canonical path theorems for mixing time of non-reve...
متن کامل2 A Rapidly Mixing Circulant Markov
We consider the problem of uniform generation of random integers in the range 1; n] given only a binary source of randomness. Standard models of randomized algorithms (e.g. probabilistic Turing machines) assume the availability of a random binary source that can generate independent random bits in unit time with uniform probability. This makes the task trivial if n is a power of 2. However, exa...
متن کامل